The forwarding indices of augmented cubes

Forwarding indices of folded n-cubes

For a given connected graph G of order n, a routing R is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forwarding index of a graph is the maximum number of paths of R passing through any vertex (resp. edge) in the graph. In this paper, the authors determine the vertex and the edge forwarding indices of a folded n-cube as (n− 1)2n−1...

Eccentric Connectivity and Augmented Eccentric Connectivity Indices of N-Branched Phenylacetylenes Nanostar Dendrimers

Augmented k-ary n-cubes

We define an interconnection network AQn,k which we call the augmented kary n-cube by extending a k-ary n-cube in a manner analogous to the existing extension of an n-dimensional hypercube to an n-dimensional augmented cube. We prove that the augmented k-ary n-cube AQn,k has a number of attractive properties (in the context of parallel computing). For example, we show that the augmented k-ary n...

Interactive Entertainment Systems Using Tangible Cubes

In this paper we present two tangible interactive entertainment interfaces using physical cubes. In the first paradigm, Magic Story Cube, we novelly used a foldable cube for tangible and interactive story telling. In the second paradigm, Jumanji Singapore, physical dices are used to directly manipulate and control the process Jumanji board game. In both of our systems, we embedded both the conc...

Fault-tolerant pancyclicity of augmented cubes

As an enhancement on the hypercube Qn, the augmented cube AQn, prosed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71–84], not only retains some favorable properties of Qn but also possesses some embedding properties that Qn does not. For example, AQn is pancyclic, that is, AQn contains cycles of arbitrary length for n 2. This paper shows that AQn re...